Search Design and Broad Matching

نویسندگان

  • Kfir Eliaz
  • Ran Spiegler
چکیده

We study decentralized mechanisms for allocating firms into search pools. The pools are created in response to noisy preference signals provided by consumers, who then browse the pools via costly random sequential search. Surplus-maximizing search pools are implementable in symmetric Nash equilibrium. Full extraction of the maximal surplus is implementable if and only if the distribution of consumer types satisfies a set of simple inequalities, which involve the relative fractions of consumers who like different products and the Bhattacharyya coeffi cient of similarity between their conditional signal distributions. The optimal mechanism can be simulated by a “keyword auction”with “broad matching”. (JEL D02, D47, D82). Consider a consumer who has a certain need and looks for a product that will satisfy it. When confronted with a particular product, the consumer can identify whether he wants it. However, when he first embarks on the search process, he is unable to provide an exact description of his need, and can only submit an imprecise “query”that fits several product types. How should a benevolent planner react to the consumer’s query? If he gives the consumer a single item, he risks ending up with a poor match. Instead, the planner may provide the consumer with a set of options to browse. If search is time-consuming, the planner should design the set in order to balance two considerations: maximizing the probability that the consumer will find what he is looking for, and minimizing the amount of time it will take him to find it. In other words, the planner’s problem is to design the consumer’s “search environment”. The consumer’s predicament is prevalent in other environments. When an employer approaches a Human Resource agency with an intention to hire a new worker, the most he can usually do is list a few characteristics that vaguely describe the kind of worker he is looking for. Likewise, when we look for a rental apartment through a real-estate agent, we typically describe only broad characteristics (location, size, amenities). A more modern example is online search, where users submit queries that often contain general and imprecise keywords. Imagine that you look for a specific piece of instrumental music on YouTube, but you forgot its name. You would recognize it instantaneously if you heard it, but the only information you can supply to YouTube is the piece’s genre. Finally, there are cases in which the consumer passively conveys information. For instance, in contemporary online platforms, the “cookies”on users’computers describe their navigation history, which may be correlated with their current needs. We attempt to capture situations of this kind with a simple model, in which every consumer is interested in only one type of product and can provide only one particular description or “query”concerning this product. Each product type is supplied by a continuum of firms; and when the consumer is given a subset of firms, he browses it using the most

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance

Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...

متن کامل

Productivity Investment and Labor Force Participation in Search Equilibrium

The present paper contributes to the theoretical analysis of the human capital investment and participation decision of heterogeneous workers in the search and matching framework‎. ‎Its aim is to characterize the equilibrium and to identify the efficiency‎. ‎Here‎, the paper studies search equilibrium and matching to consider the participation decision of heterogeneous workers who have differen...

متن کامل

A Necessary and Sufficient Condition for Graph Matching to be equivalent to Clique Search

This paper formulates a necessary and sufficient condition for a generic graph matching problem to be equivalent to the maximum vertex and edge weight clique problem in a derived association graph. The consequences of this results are threefold: first, the condition is general enough to cover a broad range of practical graph matching problems; second, a proof to establish equivalence between gr...

متن کامل

A Novel Assisted History Matching Workflow and its Application in a Full Field Reservoir Simulation Model

The significant increase in using reservoir simulation models poses significant challenges in the design and calibration of models. Moreover, conventional model calibration, history matching, is usually performed using a trial and error process of adjusting model parameters until a satisfactory match is obtained. In addition, history matching is an inverse problem, and hence it may have non-uni...

متن کامل

A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem

This paper formulates a necessary and sufficient condition for a generic graph matching problem to be equivalent to the maximum vertex and edge weight clique problem in a derived association graph. The consequences of this results are threefold: first, the condition is general enough to cover a broad range of practical graph matching problems; second, a proof to establish equivalence between gr...

متن کامل

Clustering-Based Bidding Languages for Sponsored Search

Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the advertisers in this market is the complexity of picking and evaluating keywords and phrases to bid on. This is due to the sheer number of possible keywords that the advertisers can bid on, and leads to inefficiencies in the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015